Search results for "Partial order reduction"

showing 2 items of 2 documents

The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction

2020

AbstractIn model checking, partial-order reduction (POR) is an effective technique to reduce the size of the state space. Stubborn sets are an established variant of POR and have seen many applications over the past 31 years. One of the early works on stubborn sets shows that a combination of several conditions on the reduction is sufficient to preserve stutter-trace equivalence, making stubborn sets suitable for model checking of linear-time properties. In this paper, we identify a flaw in the reasoning and show with a counter-example that stutter-trace equivalence is not necessarily preserved. We propose a solution together with an updated correctness proof. Furthermore, we analyse in whi…

FOS: Computer and information sciencesModel checkingComputer Science - Logic in Computer ScienceTheoretical computer sciencepartial-order reductionComputer scienceautomaattien teoria020207 software engineering02 engineering and technologymodel checkingArticleLogic in Computer Science (cs.LO)Partial order reductionstubborn sets0202 electrical engineering electronic engineering information engineeringState space020201 artificial intelligence & image processingEquivalence (formal languages)Equivalence (measure theory)tietojenkäsittely
researchProduct

A Detailed Account of The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction

2021

One of the most popular state-space reduction techniques for model checking is partial-order reduction (POR). Of the many different POR implementations, stubborn sets are a very versatile variant and have thus seen many different applications over the past 32 years. One of the early stubborn sets works shows how the basic conditions for reduction can be augmented to preserve stutter-trace equivalence, making stubborn sets suitable for model checking of linear-time properties. In this paper, we identify a flaw in the reasoning and show with a counter-example that stutter-trace equivalence is not necessarily preserved. We propose a stronger reduction condition and provide extensive new correc…

Model checkingFOS: Computer and information sciencesComputer Science - Logic in Computer ScienceTheoretical computer sciencepartial-order reductionGeneral Computer Sciencestutter equivalenceComputer sciencealgoritmiikkaCorrectness proofsRotation formalisms in three dimensionsTheoretical Computer ScienceLogic in Computer Science (cs.LO)Reduction (complexity)Partial order reductionstubborn setsEquivalence (measure theory)tietojenkäsittelyLTL
researchProduct